The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF).

(0) Obligation:

Runtime Complexity TRS:
The TRS R consists of the following rules:

f(cons(nil, y)) → y
f(cons(f(cons(nil, y)), z)) → copy(n, y, z)
copy(0, y, z) → f(z)
copy(s(x), y, z) → copy(x, y, cons(f(y), z))

Rewrite Strategy: FULL

(1) DecreasingLoopProof (EQUIVALENT transformation)

The following loop(s) give(s) rise to the lower bound Ω(n¹):
The rewrite sequence
copy(s(x), y, z) →⁺ copy(x, y, cons(f(y), z))
gives rise to a decreasing loop by considering the right hand sides subterm at position [].
The pumping substitution is [x / s(x)].
The result substitution is [z / cons(f(y), z)].

(2) BOUNDS(n^1, INF)